Agd{library: a Library of Algorithms for Graph Drawing 1
نویسندگان
چکیده
A graph drawing algorithm produces a layout of a graph in two-or three-dimensional space that should be readable and easy to understand. Since the aesthetic criteria diier from one application area to another, it is unlikely that a deenition of the \optimal drawing" of a graph in a strict mathematical sense exists. A large number of graph drawing algorithms taking different aesthetic criteria into account have already been proposed. In this paper we describe the design and implementation of the AGD{Library, a library of Algorithms for Graph Drawing. The library ooers a broad range of existing algorithms for two-dimensional graph drawing and tools for implementing new algorithms. The library is written in C++ using the LEDA platform for combinatorial and geometric computing ((16, 17]). The algorithms are implemented independently of the underlying visualization or graphics system by using a generic layout interface. Most graph drawing algorithms place a set of restrictions on the input graphs like planarity or biconnectivity. We provide a mechanism for declaring this precondition for a particular algorithm and checking it for potential input graphs. A drawing model can be characterized by a set of properties of the drawing. We call these properties the postcondition of the algorithm. There is support for maintaining and retrieving the postcondition of an algorithm.
منابع مشابه
A Library of Algorithms for Graph Drawing
The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It consists of C++ classes and is built on top of the library of efficient data types and algorithms LEDA; an optional add-on to AGD requires ABACUS, a framework for the implementation of branch-and-c...
متن کاملPlanar Polyline Drawings with Good Angular Resolution
We present a linear time algorithm that constructs a planar polyline grid drawing of any plane graph with n vertices and maximum degree d on a (2n ? 5) (3 2 n ? 7 2) grid with at most 5n ? 15 bends and minimum angle > 2 d. In the constructed drawings, every edge has at most three bends and length O(n). To our best knowledge, this algorithm achieves the best simultaneous bounds concerning the gr...
متن کاملDrawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI’s Site Manager application. Our layout and drawing algorithms support interactive navigation of large graphs up to 100,000 edges. We present an adaptive drawing algorithm with a guaranteed frame rate. Both layout and navigation occur in 3D hyperbolic sp...
متن کاملThe Graphlet System ( System Demonstration )
Graphlet is a portable, object oriented toolkit for graph editors and graph drawing algorithms, and is the successor of the GraphEd system. Graphlet is based on LEDA and Tcl/Tk. Algorithms can be implemented in C++ and LedaScript, a new scripting language based on Tcl/Tk. The GML format is a portable le format for graphs. The implementation and visualization of graph algorithms is an important ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997